Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
نویسندگان
چکیده
منابع مشابه
Exact and Approximation Algorithms for the Operational Fixed Interval Scheduling Problem
The Operational Fixed Interval Scheduling Problem (OFISP) is characterized as the problem of scheduling a number of jobs, each with a fixed starting time, a fixed finishing time, a priority index, and a job class. The objective is to find an assignment of jobs to machines with maximal total priority. The problem is complicated by the restrictions that: (i) each machine can handle only one job a...
متن کاملUsing Genetic Algorithms to Solve the Tactical Fixed Interval Scheduling Problem
Discrete optimization problems are usually NP hard. The structural characteristics of these problems significantly dictate the solution landscape. In this paper, we explore a structured approach to solving these kinds of problems. We use a reinforcement learning system to adaptively learn the structural characteristics of the problem, hereby decomposing the problem into several subproblems. Bas...
متن کاملAn Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملDynamic algorithms for monotonic interval scheduling problem
Imagine a number of processes all need to use a particular resource for a period of time. Each process i specifies a starting time s(i) and a finishing time f(i) between which it needs to continuously occupy the resource. The resource cannot be shared by two processes at any instance. One is required to design a scheduler which chooses a subset of these processes so that 1) there is no time con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1997
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.45.4.624